Resour e-Bounded Kolmogorov Complexity Revisited
نویسنده
چکیده
منابع مشابه
Resource bounded symmetry of information revisited
The information contained in a string x about a string y is the difference between the Kolmogorov complexity of y and the conditional Kolmogorov complexity of y given x, i.e., I(x : y) = C(y) − C(y |x). The Kolmogorov–Levin Theorem says that I(x : y) is symmetric up to a small additive term. We investigate if this property also holds for several versions of polynomial time bounded Kolmogorov co...
متن کاملOn Time-Bounded Incompressibility of Compressible Strings and Sequences
For every total recursive time bound t, a constant fraction of all compressible (low Kolmogorov complexity) strings is t-bounded incompressible (high time-bounded Kolmogorov complexity); there are uncountably many infinite sequences of which every initial segment of length n is compressible to log n yet t-bounded incompressible below 1 4n − log n; and there are a countably infinite number of re...
متن کاملResource-Bounded Kolmogorov Complexity Revisited
We take a fresh look at CD complexity, where CD t (x) is the smallest program that distinguishes x from all other strings in time t(jxj). We also look at a CND complexity, a new nondeterministic variant of CD complexity. We show several results relating time-bounded C, CD and CND complexity and their applications to a variety of questions in computational complexity theory including: Showing ho...
متن کاملThe pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
We continue an investigation into resource-bounded Kolmogorov complexity [ABK06], which highlights the close connections between circuit complexity and Levin’s time-bounded Kolmogorov complexity measure Kt (and other measures with a similar flavor), and also exploits derandomization techniques to provide new insights regarding Kolmogorov complexity. The Kolmogorov measures that have been introd...
متن کاملNL-printable sets and nondeterministic Kolmogorov complexity
P-printable sets were defined by Hartmanis and Yesha and have been investigated by several researchers. The analogous notion of Lprintable sets was defined by Fortnow et al; both P-printability and L-printability were shown to be related to notions of resource-bounded Kolmogorov complexity. NL-printability was defined by Jenner and Kirsig, but some basic questions regarding this notion were lef...
متن کامل